Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks
نویسندگان
چکیده
The “interpretation” framework in pattern recognition (PR) arises in the many cases in which the more classical paradigm of “classification” is not properly applicable generally because the number of classes is rather large or simply because the concept of “class” does not hold. A very general way of representing the results of interpretations of given objects or data is in terms of sentences of a “semantic language” in which the actions to be performed for each different object or datum are described. Interpretation can therefore be conveniently formalized through the concept of formal transduction, giving rise to the central PR problem of how to automatically learn a transducer from a training set of examples of the desired input-output behavior. This paper presents a formalization of the stated transducer learning problem, as well as an effective and efficient method for the inductive learning of an important class of transducers, namely, the class of subsequential transducers. The capabilities of subsequential transductions are illustrated through a series of experiments that also show the high effectiveness of the proposed learning method in obtaining very accurate and compact transducers for the corresponding tasks.
منابع مشابه
Automatically deriving categories for translation
An adequate approach to speech translation for small to medium sized tasks is the use of subsequential transducers —a finite state model— as language model for a speech recognizer. These transducers can be automatically trained from sample corpora. The use of manually defined categories improves the training of the subsequential transducers when the available data are scarce. These categories d...
متن کاملSpoken-Language Machine Translation in Limited Domains: Can it be Achieved by Finite-State Models? *
Subsequential transducers constitute a formal model for translation that may be considered perhaps too simple to model translation between natural languages. However, their capability can suffice in limited-domain translation tasks. The finitestate nature of subsequential transducers makes their integration with well-known Continuous Speech Recognition technology both easy and efficient. A rece...
متن کاملActively Learning Probabilistic Subsequential Transducers
In this paper we investigate learning of probabilistic subsequential transducers in an active learning environment. In our learning algorithm the learner interacts with an oracle by asking probabilistic queries on the observed data. We prove our algorithm in an identification in the limit model. We also provide experimental evidence to show the correctness and to analyze the learnability of the...
متن کاملExperiments Using OSTIA for a Language Production Task
The phenomenon of meaning-preserving corrections given by an adult to a child involves several aspects: (1) the child produces an incorrect utterance, which the adult nevertheless understands, (2) the adult produces a correct utterance with the same meaning and (3) the child recognizes the adult utterance as having the same meaning as its previous utterance, and takes that as a signal that its ...
متن کاملBilingual Clustering Using Monolingual Algorithms
The use of bilingual word classes greatly reduces the amount of data needed for training subsequential transducers, a finite state model adequate for small to medium translation tasks. We present an automatic approach to derive these classes using traditional monolingual word clustering methods.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Pattern Anal. Mach. Intell.
دوره 15 شماره
صفحات -
تاریخ انتشار 1993